s = list(input())
i = 0
turn = 0
while i<len(s)-1:
if s[i] == s[i + 1]:
turn += 1
s.pop(i + 1)
s.pop(i)
if i == 0:
continue
i -= 1
continue
i += 1
if turn & 1:
print('Yes')
else:
print('No')#include <bits/stdc++.h>
#define ll long long
#define go ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define endl "\n"
using namespace std;
inline void solve() {
string s;
cin >> s;
bool flag = false;
stack<char> st;
for (int i = 0; i < s.size(); i++) {
if (st.empty())
st.push(s[i]);
else if (st.top() == s[i]) {
st.pop();
flag = !flag;
}
else
st.push(s[i]);
}
if (flag)
cout << "YES" << endl;
else
cout << "NO" << endl;
}
int main()
{
go;
int t = 1;
//cin >> t;
while (t--) {
solve();
}
return 0;
}
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |
74. Search a 2D Matrix | 71. Simplify Path |
62. Unique Paths | 50. Pow(x, n) |
43. Multiply Strings | 34. Find First and Last Position of Element in Sorted Array |
33. Search in Rotated Sorted Array | 17. Letter Combinations of a Phone Number |
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |